#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=4e5;
typedef long long LL;
const LL mod=998244353;
LL ksm(LL a,LL k){
    LL res=1;
    while(k){
        if(k&1) res=res*a%mod;
        a=a*a%mod;
        k>>=1;
    }
    return res%mod;
}
LL fac[maxn],a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  fac[0]=1;
  for(LL i=1;i<maxn;i++) fac[i]=fac[i-1]*i%mod;
  LL n;cin>>n;
  for(LL i=1;i<=2*n;i++){
    cin>>a[i];
  }
  sort(a+1,a+1+2*n);
  LL ans=0;
  for(LL i=n+1;i<=2*n;i++) ans+=a[i];
  for(LL i=1;i<=n;i++) ans-=a[i];
  LL cnt=ans%mod*fac[2*n]%mod*ksm(fac[n],mod-2)%mod*ksm(fac[n],mod-2)%mod;
  cout<<cnt<<endl;
return 0;
}
